A Secure Secret Image Sharing Scheme Without Safeguarding a Key
نویسندگان
چکیده
منابع مشابه
Secure Routing Scheme in MANETs using Secret Key Sharing
A Mobile Ad-hoc NETwork (MANETs) follows a dynamic topology with distributed architecture. MANETs has no basic infrastructure also has no fixed access point or routers, where in the nodes moves in an undefined manner in a specified area of work. Basically, the distributed dynamic architecture is vulnerable to various kinds of attacks like blackhole, wormhole flooding, etc. Providing a security ...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملNonlinear Secret Image Sharing Scheme
Over the past decade, most of secret image sharing schemes have been proposed by using Shamir's technique. It is based on a linear combination polynomial arithmetic. Although Shamir's technique based secret image sharing schemes are efficient and scalable for various environments, there exists a security threat such as Tompa-Woll attack. Renvall and Ding proposed a new secret sharing technique ...
متن کاملRefinement of visual secret sharing scheme without image size expansion
1 [email protected] 2 [email protected] Abstract: The basic idea of the Visual Cryptography is to encrypt a secret image into n number of meaningless share images. The Visual Cryptography technique cannot leak the encrypted information of the shared secret by virtue of any combination of the n share images combined together. The share images are printed on transparencies and distribut...
متن کاملUnconditionally Secure Verifiable Secret Sharing Scheme
Abstract A (t, n) secret sharing scheme permits a secret to be divided into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. Verifiable secret sharing (VSS) has been proposed to allow each shareholder to verify the validity of his own share, but not other shareholders' shares. In this paper, we propose an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Engineering and Technology Research
سال: 2017
ISSN: 2475-885X
DOI: 10.12783/dtetr/iceta2016/6969